On the minimum number of minimal codewords
نویسندگان
چکیده
We study the minimum number of minimal codewords in linear codes from point view projective geometry. derive bounds and some cases determine exact values. also present an extension to subcode supports.
منابع مشابه
The minimum number of minimal codewords in an [n, k]-code and in graphic codes
We survey some lower bounds on the function in the title based on matroid theory and address the following problem by Dosa, Szalkai, Laflamme [9]: Determine the smallest number of circuits in a loopless matroid with no parallel elements and with a given size and rank. In the graphic 3-connected case we provide a lower bound which is a product of a linear function of the number of vertices and a...
متن کاملThe maximum number of minimal codewords in long codes
Upper bounds on the maximum number of minimal codewords in a binary code follow from the theory of matroids. Random coding provide lower bounds. In this paper we compare these bounds with analogous bounds for the cycle code of graphs. This problem (in the graphic case) was considered in 1981 by Entringer and Slater who asked if a connected graph with p vertices and q edges can have only slightl...
متن کاملMinimum distance and the minimum weight codewords of Schubert codes
We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by Xiang. We give an alternative proof of this formula. Further, we propose a characterization of the minimum weight codewords of Schubert codes by introducing the n...
متن کاملBounds on Minimal Codewords in Linear Codes
The notion of minimal codewords in linear codes was introduced recently by Massey. In this paper two weight bounds on minimal code-words are proved; an upper bound above which no codewords are minimal and a lower bound below which all codewords are minimal. It is shown for Hamming codes that every weight class between the two bounds contains at least one minimal codeword and at least one non-mi...
متن کاملOn the Non-minimal Codewords in Binary Reed-Muller Codes
First, we compute the number of non-minimal codewords of weight 2dmin in the binary Reed-Muller code RM(r,m). Second, we prove that all codewords of weight greater than 2m − 2m−r+1 in binary RM(r,m), are non-minimal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2023
ISSN: ['1930-5346', '1930-5338']
DOI: https://doi.org/10.3934/amc.2020130